Simplification Rules for Constrained Formula Tableaux
نویسنده
چکیده
Several variants of a first-order simplification rule for nonnormal form tableaux using syntactic constraints are presented. These can be used as a framework for porting methods like unit resolution or hyper tableaux to non-normal form free variable tableaux.
منابع مشابه
Saturation Up to Redundancy for Tableau and Sequent Calculi
We discuss an adaptation of the technique of saturation up to redundancy, as introduced by Bachmair and Ganzinger [1], to tableau and sequent calculi for classical first-order logic. This technique can be used to easily show the completeness of optimized calculi that contain destructive rules e.g. for simplification, rewriting with equalities, etc., which is not easily done with a standard Hint...
متن کاملTableaux + Constraints
There is an increasing number of publications in which the analytic tableaux calculus is combined with technology based on constraint solving. Although the details, as well as the purpose of these combinations vary widely, the results are invariably referred to as “constraint tableaux” or sometimes “constrained tableaux”. We review some of the combinations and propose a more differentiated nome...
متن کاملTowards the use of Simplification Rules in Intuitionistic Tableaux
By replacement it is meant the substitution of one or more occurrences of a formula with an equivalent one. In automated deduction this can be useful to reduce the search space. In tableau calculi for classical and modal logics this technique is known as simplification and consists in replacing a formula with a logical constant (> or ⊥). Recently, this idea has been applied to Intuitionistic Lo...
متن کاملA Simplification Rules for Intuitionistic Propositional Tableaux
The implementation of a logic requires, besides the definition of a calculus and a decision procedure, the development of techniques to reduce the search space. In this paper we introduce some simplification rules for Intuitionistic propositional logic that try to replace a formula with an equi-satisfiable “simpler” one with the aim to reduce the search space. Our results are proved via semanti...
متن کاملSemantic Tableaux Methods for Modal Logics That Include the B(rowerische) and G(each) Axioms
As its name suggests, the method uses semantic facts about the language in an attempt to generate a countermodel for the argument at hand (or to show that there is no such counter-model and that the argument is therefore valid). In this, the method bears a strong similarity to Resolution, but it does not require any conversion to a normal form. The method is also different in being an analytic ...
متن کامل